Pallet building and truck loading strategies for an inter-depot transportation problem
نویسندگان
چکیده
The mission of logistics is basically to get the right goods or services to the right place, at the right time, and in the desired conditions, while making the greatest contribution to the company [1]. Everyday a distribution company has to decide how to put goods onto pallets according to the customers’ orders and then how to efficiently distribute these pallets among the number of trucks so as to reduce the trucks needed to supply the customers. The first problem is known as the pallet loading problem, whereas the second problem is the container loading problem. But, we solve the problem in one phase, building and placing pallets at the same time. For each position in the truck a pallet is built, tailored for that position according to the constraints. At each iteration, a randomized constructive procedure builds a solution for loading all the products.
منابع مشابه
A Benders' Decomposition Method to Solve Stochastic Distribution Network Design Problem with Two Echelons and Inter-Depot Transportation
In many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. This paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. This service level, which is consider...
متن کاملIterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints
The capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints is an extension of the classical Capacitated Vehicle Routing Problem (CVRP). It integrates loading constraints in a routing problem and is based on a real-world transportation problem. The demand of the customers consists of pallets. These pallets may be placed in two horizontal rows inside th...
متن کاملA Tight Lagrangean Relaxation Bound for the Manufacturer's Pallet Loading Problem
In this study we analyze the performance of a Lagrangean relaxation upper bound for the problem of packing the maximum number of rectangles of sizes (l; w) and (w; l) into a larger rectangle (L;W ) without overlapping. This problem appears in the loading of identical boxes on pallets, namely the manufacturer’s pallet loading problem (MPL), as well as in package design and truck or rail car load...
متن کاملDevelopment of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing
The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...
متن کاملA Tree Search Algorithm for the Manufacturer’s Pallet Loading Problem
Transportation and warehouse costs are the two major components of the total logistics cost. To increase the material handling efficiency both in transit and in the warehouse, pallets have been used widely in logistics systems. The manufacturer’s pallet loading problem (MPLP) is to pack identical smaller boxes onto a rectangle pallet to maximize the pallet utilization. In this research, we solv...
متن کامل